<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    673. Number of Longest Increasing Subsequence
   </h1>
   <p>
    Given an unsorted array of integers, find the number of longest increasing subsequence.
   </p>
   <p>
    <b>
     Example 1:
    </b>
    <br>
   </p>
   <pre>
<b>Input:</b> [1,3,5,4,7]
<b>Output:</b> 2
<b>Explanation:</b> The two longest increasing subsequence are [1, 3, 4, 7] and [1, 3, 5, 7].
</pre>
   <p>
    <b>
     Example 2:
    </b>
    <br>
   </p>
   <pre>
<b>Input:</b> [2,2,2,2,2]
<b>Output:</b> 5
<b>Explanation:</b> The length of longest continuous increasing subsequence is 1, and there are 5 subsequences' length is 1, so output 5.
</pre>
   <p>
    <b>
     Note:
    </b>
    Length of the given array will be not exceed 2000 and the answer is guaranteed to be fit in 32-bit signed int.
   </p>
  </div>
  <div>
   <h1 class="question_title">
    673. 最长递增子序列的个数
   </h1>
   <p>
    给定一个未排序的整数数组，找到最长递增子序列的个数。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
<strong>输入:</strong> [1,3,5,4,7]
<strong>输出:</strong> 2
<strong>解释:</strong> 有两个最长递增子序列，分别是 [1, 3, 4, 7] 和[1, 3, 5, 7]。
</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre>
<strong>输入:</strong> [2,2,2,2,2]
<strong>输出:</strong> 5
<strong>解释:</strong> 最长递增子序列的长度是1，并且存在5个子序列的长度为1，因此输出5。
</pre>
   <p>
    <strong>
     注意:
    </strong>
    &nbsp;给定的数组长度不超过 2000 并且结果一定是32位有符号整数。
   </p>
  </div>
 </body>
</html>